Method and system for allocating resource in wireless communication network

ABSTRACT

The present disclosure discloses methods and systems for efficiently allocating grants for resource allocation based on BSR index. The method includes receiving by a Base-Station (BS) a Buffer Status Report (BSR) index value from a User Equipment (UE) along with buffer size corresponding to an Uplink (UL) data transmission request. Upon determining the buffer size corresponding to the received BSR index value to be greater than a predefined threshold value, resources to the UE is allocated corresponding to a maximum buffer size of (BSR index-n). Upon receiving UL data from the UE based on the allocated resources, resources to the UE are allocated subsequently using a predefined allocation mechanism until one of, detection of padding bits in the received UL data and on detecting maximum allocation of predefined number of allocation.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority under 35 U.S.C. § 119(e) to IndianProvisional Patent Application No. 201941049710 filed on Dec. 3, 2019and Indian Patent Application No. 201941049710 filed on Nov. 26, 2020.The above-identified patent applications are hereby incorporated byreference in its entirety.

BACKGROUND 1. Field

The present disclosure generally relates to resource allocation inwireless networks, more particularly, but not exclusively to a methodand system for efficiently allocating grants for resource allocationbased on BSR index.

2. Description of Related Art

Wireless communication systems are widely deployed to provide varioustypes of communication services such as, in terms of voice, data, andthe like. These systems may be multiple-access systems capable ofsupporting communication with multiple users by sharing the availablesystem resources (e.g., bandwidth and transmit power). Examples of suchmultiple-access systems include, Code Division Multiple Access (CDMA)systems, Time Division Multiple Access (TDMA) systems, FrequencyDivision Multiple Access (FDMA) systems, 3rd Generation PartnershipProject (3GPP) Long Term Evolution (LTE) systems, 5th generationcommunication system and Orthogonal Frequency Division Multiple Access(OFDMA) systems.

In wireless communication specification/protocol, User Equipment (UE)reports only a BSR (Buffer Status Report) index corresponding buffervalues that is between lower and higher bound of the buffer associatedwith the BSR index. The network generally allocates grant for BSR indexin multiple steps based on padding reported in MAC CE.

SUMMARY

A method and system for efficiently allocating resource based on BSRindex are provided. The method includes receiving by a Base-Station (BS)a Buffer Status Report (BSR) index value from a User Equipment (UE)along with buffer size corresponding to an Uplink (UL) data transmissionrequest. The method includes determining the buffer size correspondingto the received BSR index value to be greater than a predefinedthreshold value and allocating resources to the UE corresponding to amaximum buffer size of an index (BSR index-n), where n is an integernumber greater than or equal to “0”. Upon receiving UL data from the UEbased on the allocated resources, the method includes allocatingresources to the UE subsequently using a predefined allocation mechanismuntil one of, detection of padding bits in the received UL data and ondetecting maximum allocation of predefined number of allocation.

In an embodiment, the present disclosure may relate to a systemconfigured in a base station for efficiently allocating resource basedon BSR index. The system may include a processor and a memorycommunicatively coupled to the processor, where the memory storesprocessor executable instructions, which, on execution, may cause thegrant allocation system to receive a Buffer Status Report (BSR) indexvalue from a User Equipment (UE) along with buffer size corresponding toan Uplink (UL) data transmission request. The system determines thebuffer size corresponding to the received BSR index value to be greaterthan a predefined threshold value and allocates resources to the UEcorresponding to a maximum buffer size of an index (BSR index-n), wheren is an integer number greater than or equal to 0. Upon receiving ULdata from the UE based on the allocated resources, resources to the UEare allocated subsequently using a predefined allocation mechanism untilone of, detection of padding bits in the received UL data and ondetecting maximum allocation of predefined number of allocation.

In another embodiment, the present disclosure may relate to a method forefficiently allocating resource based on BSR index. The method includesreceiving a Buffer Status Report (BSR) index value from a User Equipment(UE) along with buffer size corresponding to an Uplink (UL) datatransmission request. The buffer size corresponding to the received BSRindex value is compared with a predefined threshold value. ondetermining the buffer size to be greater than a predefined thresholdvalue, the method includes allocating resources to the UE correspondingto maximum buffer size of ab index (BSR index-n), where n is an integernumber greater than or equal to 0. The method includes receiving the ULdata based on the allocated resources along with a BSR index value forremaining data in buffer. Further, the method includes repeatedlyperforming above steps until detecting one of, the buffer sizecorresponding to the requested BSR index value to be less than thepredefined threshold value and on detecting maximum allocation ofpredefined number of allocations.

In another embodiment, the present disclosure may relate to a method forresource allocation based on BSR index. The method includes determininga Buffer Status Report (BSR) index value for Uplink (UL) data to betransmitted using a predefined buffer index table. The method includestransmitting the determined BSR index value along with buffer sizecorresponding to the Uplink (UL) data to the BS. Further, the methodincludes receiving an allocated resource corresponding to maximum buffersize of an index (BSR index-n), where n is an integer number greaterthan or equal to 0. Thereafter, the method includes transmitting the ULdata along with a BSR index value for remaining UL data iteratively tothe BS, until the transmission the UL data is completed.

In an embodiment, the present disclosure may relate to a User Equipment(UE) for resource allocation based on BSR index. The UE may include aprocessor and a memory communicatively coupled to the processor, wherethe memory stores processor executable instructions, which, onexecution, may cause the UE to determine a Buffer Status Report (BSR)index value for Uplink (UL) data to be transmitted using a predefinedbuffer index table. The UE transmits the determined BSR index valuealong with buffer size corresponding to the Uplink (UL) data to the BS.The UE receives an allocated resource corresponding to maximum buffersize of an index (BSR index-n), where n is an integer number and greaterthan or equal to 0. Thereafter, the UE transmits the UL data along witha BSR index value for remaining UL data iteratively to the BS, until thetransmission the UL data is completed.

In another embodiment, the present disclosure may relate to a method forefficiently allocating resource based on BSR index. The method includesreceiving a Buffer Status Report (BSR) index value from a User Equipment(UE) along with buffer size corresponding to an Uplink (UL) datatransmission request. Further, the method includes estimating an optimalresource grant for the UE for the requested BSR index based on at leastone of UE parameters and network parameters using a pretrained machinelearning model.

The foregoing summary is illustrative only and is not intended to be inany way limiting. In addition to the illustrative aspects, embodiments,and features described above, further aspects, embodiments, and featureswill become apparent by reference to the drawings and the followingdetailed description.

Before undertaking the DETAILED DESCRIPTION below, it may beadvantageous to set forth definitions of certain words and phrases usedthroughout this patent document: the terms “include” and “comprise,” aswell as derivatives thereof, mean inclusion without limitation; the term“or,” is inclusive, meaning and/or; the phrases “associated with” and“associated therewith,” as well as derivatives thereof, may mean toinclude, be included within, interconnect with, contain, be containedwithin, connect to or with, couple to or with, be communicable with,cooperate with, interleave, juxtapose, be proximate to, be bound to orwith, have, have a property of, or the like; and the term “controller”means any device, system or part thereof that controls at least oneoperation, such a device may be implemented in hardware, firmware orsoftware, or some combination of at least two of the same. It should benoted that the functionality associated with any particular controllermay be centralized or distributed, whether locally or remotely.

Moreover, various functions described below can be implemented orsupported by one or more computer programs, each of which is formed fromcomputer readable program code and embodied in a computer readablemedium. The terms “application” and “program” refer to one or morecomputer programs, software components, sets of instructions,procedures, functions, objects, classes, instances, related data, or aportion thereof adapted for implementation in a suitable computerreadable program code. The phrase “computer readable program code”includes any type of computer code, including source code, object code,and executable code. The phrase “computer readable medium” includes anytype of medium capable of being accessed by a computer, such as readonly memory (ROM), random access memory (RAM), a hard disk drive, acompact disc (CD), a digital video disc (DVD), or any other type ofmemory. A “non-transitory” computer readable medium excludes wired,wireless, optical, or other communication links that transporttransitory electrical or other signals. A non-transitory computerreadable medium includes media where data can be permanently stored andmedia where data can be stored and later overwritten, such as arewritable optical disc or an erasable memory device.

Definitions for certain words and phrases are provided throughout thispatent document, those of ordinary skill in the art should understandthat in many, if not most instances, such definitions apply to prior, aswell as future uses of such defined words and phrases.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present disclosure and itsadvantages, reference is now made to the following description taken inconjunction with the accompanying drawings, in which like referencenumerals represent like parts:

FIG. 1A illustrates an exemplary environment for efficiently allocatingresource based on BSR index in accordance with some embodiments of thepresent disclosure;

FIG. 1B illustrates an exemplary block diagram of a base station forefficiently allocating resource based on BSR index in accordance withsome embodiments of the present disclosure;

FIG. 1C illustrates an exemplary block diagram of a User Equipment (UE)for resource allocation based on BSR index in accordance with someembodiments of the present disclosure;

FIG. 2A illustrates a detailed block diagram of a grant allocationsystem in accordance with some embodiments of the present disclosure;

FIG. 2B illustrates a detailed block diagram of a User Equipment (UE) inaccordance with some embodiments of the present disclosure;

FIG. 3A-3C illustrate exemplary embodiments for efficiently resourcebased on BSR index in accordance with some embodiments of the presentdisclosure;

FIG. 4A-4B illustrate flowcharts showing method for efficient allocatingresource based on BSR index by base station, in accordance with someembodiments of present disclosure;

FIG. 5A-5B illustrate exemplary flowcharts for allocating resource basedon BSR index in accordance with some embodiments of the presentdisclosure;

FIG. 6 illustrates a flowchart showing a method for allocating resourceallocation based on BSR index by user equipment, in accordance with someembodiments of present disclosure;

FIG. 7 illustrates exemplary graphs for simulation output for BSR index121-200 in accordance with some embodiments of present disclosure; and

FIG. 8 illustrates a block diagram of an exemplary user equipment forimplementing embodiments consistent with the present disclosure.

It should be appreciated by those skilled in the art that any blockdiagrams herein represent conceptual views of illustrative systemsembodying the principles of the present subject matter. Similarly, itwill be appreciated that any flow charts, flow diagrams, statetransition diagrams, pseudo code, and the like represent variousprocesses which may be substantially represented in computer readablemedium and executed by a computer or processor, whether or not suchcomputer or processor is explicitly shown.

DETAILED DESCRIPTION

FIGS. 1A through 8 , discussed below, and the various embodiments usedto describe the principles of the present disclosure in this patentdocument are by way of illustration only and should not be construed inany way to limit the scope of the disclosure. Those skilled in the artwill understand that the principles of the present disclosure may beimplemented in any suitably arranged system or device.

In the present document, the word “exemplary” is used herein to mean“serving as an example, instance, or illustration.” Any embodiment orimplementation of the present subject matter described herein as“exemplary” is not necessarily to be construed as preferred oradvantageous over other embodiments.

While the disclosure is susceptible to various modifications andalternative forms, specific embodiment thereof has been shown by way ofexample in the drawings and will be described in detail below. It shouldbe understood, however that it is not intended to limit the disclosureto the particular forms disclosed, but on the contrary, the disclosureis to cover all modifications, equivalents, and alternative fallingwithin the scope of the disclosure.

The terms “comprise”, “comprising”, or any other variations thereof, areintended to cover a non-exclusive inclusion, such that a setup, device,or method that comprises a list of components or steps does not includeonly those components or steps but may include other components or stepsnot expressly listed or inherent to such setup or device or method. Inother words, one or more elements in a system or apparatus proceeded by“comprises . . . a” does not, without more constraints, preclude theexistence of other elements or additional elements in the system ormethod.

In the following detailed description of the embodiments of thedisclosure, reference is made to the accompanying drawings that form apart hereof, and in which are shown by way of illustration specificembodiments in which the disclosure may be practiced. These embodimentsare described in sufficient detail to enable those skilled in the art topractice the disclosure, and it is to be understood that otherembodiments may be utilized and that changes may be made withoutdeparting from the scope of the present disclosure. The followingdescription is, therefore, not to be taken in a limiting sense.

Wireless resource allocation and buffer status reporting may be based onpacket size, and a base station may allocate resources forcommunications with the UE to provide resources for an integer number ofpackets. For downlink communications from a base station to a UE, ascheduler may allocate resources to transmit an integer number ofpackets, based on packet size and number of packets to be transmitted.For uplink communications, a UE may transmit a buffer status report(BSR) that indicates packet size and number of packets to betransmitted. The base station may allocate uplink resources to the UEthat correspond to an integer number of packets. Resources may beallocated that have a variable length transmission time interval (TTI)that may be adjusted, alone or in combination with other resources(e.g., frequency resources), to provide for transmission of an integernumber of packets.

Conventionally, there exist two types of data structure. One is shortBSR and the other is long BSR. With short BSR, UE can inform the amountof data in UL buffer only for one specific Logical Channel Group (LCG).That is the reason for “LCG ID” field at the beginning of short BSR.With long BSR, the UE may inform the UL buffer information for all LCG.That is the reason for no specific LCG ID field in long BSR, but theyhave multiple ‘Buffer Size’ field, each of which represent one LCG.Similar issues have been noticed for other BSR reporting methods aswell.

The MAC specification defines the UE to report only BSR index and the UEdoes not need to report actual buffer size. In case of higher BSRindexes, the difference in number of bytes between lower and upper boundare considerably significant. In other words, as the number of BSR indexincreases, as the gap between lower and upper bound according to the BSRindex increases. Currently, the network may err to fall on the higherbound of BSR index without considering the actual buffer size relativeto the higher bound. The excess UL grant allocated is filled withpadding in case of less usable data. In other words, in case that theamount of allocated UL resource is larger than the amount of the UL datato be uplinked from the UE, the UE fills data with padding bits. Thehigher number of padding leads to wastage of radio resources of the basestation and transmission power for the UE. For instance, consider a casewhen a UE reports the BSR index in a time slot “t”, and resourceallocation is performed in time slot “n”. Between the time slot t and n,a Base station (BS) can predict expected data for the UE and allocatethe resource allocation efficiently.

Hence, there is a need of a system and method for resource allocation,wherein the UE may report BSR index based on the buffer occupancy sizeand network which may allocate grant for upper bound of BSR index.

Embodiments of the present disclosure relates to a method and a systemfor efficiently allocating grants for resource allocation based onBuffer Status Report (BSR) index. Typically, a BSR is defined as a MACControl Element (CE) from a User Equipment (UE) to a network carryinginformation on how much data in UE buffer is to be transmitted.Currently, the UE reports only a BSR index corresponding buffer valuesthat is between lower and higher bound of the buffer associated with theindex. However, the network tends to determine the higher bound sinceexact buffer size is never reported. If the actual buffer size is closerto lower bound, it may lead to resource under-utilization and higherpadding bits since the Uplink (UL) allocation is closer to upper boundof BSR index. The MAC specification defines the UE to report only BSRindex and not the buffer size. In case of higher BSR indexes, thedifference in number of bytes between lower and upper bound areconsiderably significant. The network may determine the higher bound ofBSR index without considering the actual buffer size relative to thehigher bound. The excess UL grant allocated is filled with padding incase of less usable data. This causes under-utilization and wastage ofallocated radio resources such as, bandwidth resource.

The present disclosure in such condition allocates resources efficientlyby allocating resources to the UE corresponding to a maximum buffer sizeof an index (BSR index-n), where n is an integer number greater than orequal to 0. The resources are allocated after determining a buffer sizecorresponding to the received BSR index value from the UE to be greaterthan a predefined threshold value. Thus, upon receiving UL data from theUE based on the allocated resources, the present disclosure allocatesresources to the UE subsequently using a predefined allocation mechanismuntil one of, detection of padding bits in the received UL data and ondetecting maximum allocation of predefined number of allocation.Therefore, the UE is allocated resource grants in multiple sequence andnot in single UL allocation, especially for BSR of higher sizes. As aresult, the present disclosure helps in efficiently allocating andscheduling resource grant based on BSR index value to minimize bytepadding. In addition, the present disclosure allows network to save onresource and serve more users by differing BSR grant resources to UE inmultiple iterations.

FIG. 1A illustrates an exemplary environment for efficiently allocatingresource based on BSR index in accordance with some embodiments of thepresent disclosure.

As shown in FIG. 1A, an environment 100 relates to wirelesscommunication and includes a Base station (BS) 101 communicativelyconnected to a User Equipment (UE) 105. The BS 101 is a fixed point ofcommunication for the UE 105 on a carrier network for providing networkservices. The wireless communication may include different generationssuch as, 2^(nd) Generation (2G), 3rd Generation (3G), Long TermEvolution (LTE), 5^(th) Generation (5G), 6th Generation (6G) andnon-3gpp technologies.

The BS 101 is configured with a grant allocation system 103 forefficiently allocating grants for resource allocation based on BSRindex. The BS 101 is connected to Cloud Random Access Networks (RAN)(not shown explicitly in FIG. 1A), which includes multiple stand-alonebase stations (BTS). In an embodiment, backend layer processing may beperformed in the cloud RAN.

In one embodiment, the grant allocation system 103 may be configured asa separate entity to the BS 101. In another embodiment, the grantallocation system 103 may be configured in associated with otherentities in the BS 101 in order to efficiently allocate grants forresource allocation. Each BTS covers a small area, whereas a group BTSprovides coverage over a continuous area. Each BTS processes andtransmits its own signal to and from the UE 105, and forwards data toand from the UE 105.

FIG. 1B illustrates an exemplary block diagram of a base station forefficiently allocating resource based on BSR index in accordance withsome embodiments of the present disclosure. As shown, the BS 101includes the grant allocation system 103, a transmitter 113 and areceiver 115. The BS 101 may include any other component not shownexplicitly in the FIG. 1B. The grant allocation system 103 may includean I/O interface 107, a memory 109, a processor 111. The I/O interface107 may be configured to receive configurations and any UE relatedinformation from the transmitter 113. The configurations and UE relatedinformation received by the I/O interface 107 may be stored in thememory 109. The memory 109 may be communicatively coupled to theprocessor 111. The memory 109 may also store processor instructionswhich may cause the processor 111 to execute the instructions forefficiently allocating grants for resource allocation based on BSRindex.

During uplink data transmission, the grant allocation system 103 mayreceive a Buffer Status Report (BSR) index value from the UE 105 alongwith a buffer size corresponding to an Uplink (UL) data transmissionrequest. In an embodiment, BSR reporting procedure is used to providethe BS 101 with information about amount of data available fortransmission in the UL buffers of the UE 105. The BSR is reported as anindex value based on the buffer size. A buffer index table is apredefined table which may be used for determining the index value. Thebuffer index table is configured in the UE 105 for determining the BSRindex value and the buffer index table is also known to the BS 101. Asthe number of BSR index value increases, the amount of the buffer sizeincreases. For instance, the buffer index table may be predefined asfollowing table 1. Assume that the number of bytes in the UE buffer is800000 bytes. In case that the buffer index value is determined as“180”, then 24928 bytes should be padded in uplink data.

TABLE 1 BSR index Buffer Size (bytes) . . . . . . 178 ≤727427 179≤774645 180 ≤824928 181 ≤878475

Thus, according to the present disclosure, to reduce wastage ofresource, upon receiving the UL data transmission request, the grantallocation system 103 may compare the buffer size corresponding to thereceived BSR index value with a predefined threshold value. Thepredefined threshold value refers to maximum buffer value correspondingto the received BSR index value (BSR-n). Based on comparison, when theBSR index value is determined as greater than the predefined thresholdvalue, the grant allocation system 103 may allocate resources to the UE105 such that the grant corresponds to a maximum buffer size of BSRindex of (BSR index value-n), where “n” is an integer number greaterthan or equal to “0”. In an embodiment, the value of “n” is decided by ascheduler in the BS 101 based on load condition in the BS 101 and UE andnetwork conditions. For instance, when the load is light in the BS 101,the scheduler may decided the value of “n” as “0” with maximumallocation. On the other hand, when the BSR index value is determined aslesser than the predefined threshold value, the grant allocation system103 may allocate the resources to the UE 105 corresponding to maximumbuffer size of received BSR index value.

Once the grant allocation system 103 receives UL data from the UE 105based on the allocated resources, the grant allocation system 103 maycheck for padding bits in the received UL data. In an embodiment, the ULdata may be non-real time data. In case, the padding bites are notdetected, the grant allocation system 103 may further allocatesresources to the UE 105 subsequently using a predefined allocationmechanism. The subsequent resource allocation may take place until oneof, detection of padding bits in the received UL data and detectingmaximum allocation of predefined number of allocation. For example,consider if the allocated grant is for “25953 bits” and remaining bytesin UE to be transmitted is “25355”. In such case, the UE 105 maytransmit “25355 bits” of UL data along with “598 bits” as dummy bits,based on the difference between the allocated grant and remaining bytes.In another instance, assuming that the maximum number of allocatinggrant to UE 105 is “3 times”, the grant allocation system 103 mayfurther allocate resources to the UE 105 subsequently until theallocation reaches the maximum number of allocation, i.e., three timesin this case.

The predefined allocation mechanism may include determining, uponreceiving the UL data from the UE 105, the buffer size for allocationbased on a ratio of difference between previously requested BSR indexand allocated BSR index of (BSR index-n) and a predefined scaling value.In an embodiment, the predefined scaling value is an integer value. Forexample, the predefined scaling value is two. The same is represented bybelow equation 1:Max bytes of BSR index−Max bytes of(BSR index−n)/(E{circumflex over( )}I)  (1)

-   -   where, E=scaling value    -   I=iteration counter.

An example for the predefined allocation mechanism is explainedsubsequently in FIG. 3B.

In an embodiment, the present disclosure may include resource allocationfor downlink transmission as well. In the downlink transmission, the BS10 may allocate resources by considering load of the BS 101 and otherneighbouring BS and UE wireless parameters and other transmissionparameters. In an embodiment, system performance can be function ofnumber of wireless parameters. Further, the present disclosure isextended for systems such as, Time Division Duplex (TDD), FrequencyDivision Duplex (FDD), Dynamic TDD systems and the like.

In another implementation, once the resource is allocated, the grantallocation system 103 may receive the UL data from the UE 105 along witha BSR index value for remaining data in buffer. In such cases, the UE105 may transmit the UL data along with a signalling indicating BSRindex value for remaining data. Thus, the UE 105 is configured forresource allocation based on BSR index. Based on the presence or absenceof the signalling, the BS 101 may allocate the grant to the UE 105. Thatis, in absence of this signal from the UE 105, the grant allocationsystem 103 may use the predefined allocation mechanism for subsequentallocation. The UE 105 may include, but is not limited to, a laptop, acomputer, a notebook, a smartphone, a tablet, and any other usercomputing devices. A person skilled in the art would understand that,any other devices, not mentioned explicitly, may also be used as the UE105 in the present disclosure.

FIG. 1C illustrates an exemplary block diagram of a User Equipment (UE)for resource allocation based on BSR index in accordance with someembodiments of the present disclosure. As shown, the UE 105 may includean I/O interface 117, a memory 119, a processor 121. The I/O interface117 may be configured to receive resource allocation from the grantallocation system 103. The resource allocation received by the I/Ointerface 117 may be stored in the memory 119. The memory 119 may becommunicatively coupled to the processor 121 of UE 105. The memory 119may also store processor instructions. The UE 105 may determine the BSRindex value for UL data to be transmitted using a predefined bufferindex table. Particularly, the UE 105 receives the allocated resourcecorresponding to maximum buffer size of index value (BSR index-n) andtransmits the UL data along with the BSR index value for remaining ULdata iteratively until the transmission the UL data is completed.

In such case, upon receiving the UL data along with BSR index forremaining data, the grant allocation system 103 may repeatedly performcomparison of the the buffer size corresponding to the received BSRindex value with the predefined threshold value, allocation of theresources and receiving of the UL data, until the grant allocationsystem 103 detects one of, the buffer size corresponding to therequested BSR index value to be less than the predefined threshold valueand detecting maximum allocation of predefined number of allocation.

Alternatively, in another implementation, the BS 101, particularly, thegrant allocation system 103 may allocate grants for resource allocationusing neural network technique. Particularly, the BS 101 on receiving aBuffer Status Report (BSR) index value from the UE 105 may estimate anoptimal resource grant for the requested BSR index based on at least oneof UE parameters and network parameters using a pretrained NeuralNetwork (NN) model. The NN may essentially predict the parameters forthe predefined allocation mechanism. That is, the NN predicts the valuefor scaling factor (E) and Iteration Counter (I) as defined in equation1.

The neural network (NN) may be trained using one or more parameters suchas, time, BS identification number, frequency of operation, bandwidthpaths, day details, place of location, density of the traffic,distribution of the traffic, climate conditions, occasions, calendarbased events, vacation details/distribution, UE information, UE type, Txand Rx Antenna parameters, beam index, TDD/FDD/Dynamic TDD, UE category,BS/TX mode and monthly package, data type information, holiday relatedparameters, measurements, offers on release date, one or more events,QoS and QCI (QoS class identifier) and different communicationcapability information. The neural network model is trained either usinginstantaneous or offline data associated with plurality of UE's andnetwork.

In an embodiment, the trained neural network model may be implementedusing a deep learning (NN) or a Machine Learning (ML) model orArtificial Intelligence (AI) model. Such (NN) may be trained usingbelief propagation-based algorithm to estimate optimal grant ofresources. In an embodiment, the trained neural network may be asoftware module or hardware module. Such trained neural network may runin CU or DU or RIC or any intelligence module and may be situated in anylayer based on implementation and architecture of network. In anembodiment, the neural network may be a Convolution Neural Network (CNN)or Recurrent Neural Network (RNN), or Deep Neural Network (DNN) orsparse CNN or sparse DNN or Sparse RNN or hybrid-based architectures. Inan embodiment, ML, AI AND NN are used interchangeably in the presentdisclosure.

One can derive rule-based formulas using algorithms in the trainedmodule. Further, while estimating the optimal resource grant for the UE105, the grant allocation system 103 may consider future requirements ofthe UE 105. In an embodiment, the grant allocation system 103 may assigna penalty in case of detecting wastage of spectrum and networkresources. Further, after training the neural network model in atraining phase, the neural network model may estimate requiredtransmissions and estimate the grant allocation in each transmission. Inan embodiment, the grant allocation from the neural network model may beindicated to the MAC layer via E2 interface. As a result, the estimatedgrant allocation may be used by the MAC layer for allocating theresources to the UE 105.

Further, feedback from the neural network model may be used by otherblocks in the MC. Thereby benefitting overall performance. In anembodiment, the ML/AI models may be implemented in real or near realtime systems.

Further, in an embodiment, various split options are available forCRAN/VRAN systems. Based on the split option chosen by an operator,estimated grants values are conveyed to the MAC layer via X2 interface,if the MAC scheduling module is in RRH. In an embodiment, terms such as,BS/RU/RRH/eNodeB/gNodeB are interchangeably used in the disclosure. Itis understood that interfaces names may change from one technology toother technology or across various split architectures covered in 3gpp.

FIG. 2A illustrates a detailed block diagram of a grant allocationsystem in accordance with some embodiments of the present disclosure.

The grant allocation system 103 may include data 200 and one or moremodules 211 which are described herein in detail. In an embodiment, data200 may be stored within the memory 109. The data 200 may include, forexample, uplink request data 201, buffer threshold data 203, resourceallocation data 205, uplink data 207 and other data 209.

The uplink request data 201 may include information about the uplinktransmission request of the UE 105. The information may include BSRindex value along with the buffer size. In an embodiment, theinformation may include any other information required for the uplink ordownlink transmission request.

The buffer threshold data 203 may include information about thepredefined threshold value which is required for comparing with thereceived buffer size. The predefined threshold value refers to themaximum buffer value corresponding to received BSR index value of (BSRindex-n).

The resource allocation data 205 may include information about theresources allocated for the UE 105. The resource allocation data 205 mayalso include information about the amount of buffer size allocated forthe UE 105 for the uplink transmission request.

The uplink data 207 may include the uplink data received from the UE 105based on the allocated resources. In one embodiment, the uplink data 207may also include BSR index value for remaining data in the UE 105, alongwith the uplink data.

The other data 209 may store data, including temporary data andtemporary files, generated by modules 211 for performing the variousfunctions of the grant allocation system 103.

In an embodiment, the data 200 in the memory 109 are processed by theone or more modules 211 in the memory 109 of the grant allocation system103. In an embodiment, the one or more modules 211 may be implemented asdedicated units. As used herein, the term module refers to anapplication specific integrated circuit (ASIC), an electronic circuit, afield-programmable gate arrays (FPGA), Programmable System-on-Chip(PSoC), a combinational logic circuit, and/or other suitable componentsthat provide the described functionality. In some implementations, theone or more modules 211 may be communicatively coupled to the processor111 for performing one or more functions of the grant allocation system103.

In one implementation, the one or more modules 211 may include, but arenot limited to a communication module 213, a buffer size determinationmodule 215, a resource allocation module 217, and an efficient resourceallocation module 219. The one or more modules 211 may also includeother modules 221 to perform various miscellaneous functionalities ofthe grant allocation system 103. In an embodiment, the other modules 221may include a threshold determining module which may determine maximumbuffer value corresponding to the received BSR index value.

The communication module 213 may obtain the BSR index value along withthe buffer size corresponding to an UL data transmission request fromthe UE 105. Further, the communication module 213 may receive the uplinkdata from the UE 105.

The buffer size determination module 215 may determine the buffer sizeby comparing the buffer size corresponding to the received BSR indexvalue with the predefined threshold value. Based on the comparison, ifthe buffer size is determined to be less than the predefined thresholdvalue, buffer size determination module 215 may determine allocation ofthe resources corresponding to maximum buffer size of received BSR indexvalue. Alternatively, if the buffer size corresponding to received BSRindex value is determined to be greater than the predefined thresholdvalue, the buffer size determination module 215 may determine allocationof the resources corresponding to maximum buffer size of index value(BSR index-n). For instance, consider the buffer size is “800000” andthe requested BSR index value is “180”. The predefined threshold valuerefers to the maximum buffer value corresponding to received BSR indexvalue (BSR index-n), where n is decided to be “1”). In this case, themaximum buffer value corresponding to the BSR index value (BSR-1), i.e.,“179” is “774645”, which is the threshold value. In such case, thebuffer size determination module 215 may compare the buffer size“800000” with “774645” which is the predefined threshold value. Since,the buffer size “800000” corresponding to received BSR index value “180”is determined to be greater than the predefined threshold value“774645”, the buffer size determination module 215 may determineallocation of the resources corresponding to maximum buffer size of (BSRindex-n), i.e., BSR 179. Likewise, in another instance, resources arerequired to be allocated for BSR index-n index. However, consider thatdue to heavy load, the BS 101 may not be able to allocate the resources.In such case, the resource allocation system 101 may allocate lowergrant or postpone the grant. This may occur in every step. Further, theresource allocation system 101 using the NN may predict whether toallocate the lower grant or post X slots, where X value can be predictedbased on function of QoS and other UE and network wireless parameters.Thus, in an embodiment, the NN may decide the grant based on loadconditions. For example, if load is light, or high priority user data orhigh priority QCI type, then the NN may decide to provide grants suchas, n=′ 0′. Further, “n” may be selected as n>1 if the load is high orQCI type is low priority type or both. In an embodiment, a centralizedscheduler may decide the resource allocation in order to mitigateinterference. In an embodiment, static resource grants may be provided,for example, n=3, and the process of allocation may be terminated onidentifying the padding bits or identifying maximum iterations.

The resource allocation module 217 may allocate resources to the UE 105for the uplink data transmission based on the output of the buffer sizedetermination module 215. The resource allocation module 217 allocatesresources corresponding to maximum buffer size of (BSR index−n),whenever the buffer size corresponding to the received BSR index valueis determined to be greater than the predefined threshold value.

Once the uplink data is received from the UE 105, the efficient resourceallocation module 219 may check for padding bits in the uplink data. Incase of absence of padding bits, the efficient resource allocationmodule 219 may allocate resources to the UE 105 subsequently until oneof detection of padding bits in the received UL data or detectingmaximum allocation of predefined number of allocation. In anotherembodiment, the uplink data may be received along with the BSR indexvalue for the remaining data from the UE 105. In such case, theefficient resource allocation module 219 may trigger the buffer sizedetermination module 215 to determine the buffer size and allocate theresources until detecting either the buffer size corresponding to therequested BSR index value to be less than the predefined threshold valueor on detecting the maximum allocation of predefined number ofallocations. FIG. 3A-3C illustrate exemplary embodiments for efficientlyallocating grants for resource allocation based on BSR index inaccordance with some embodiments of the present disclosure.

FIG. 3A-3C illustrate exemplary scenarios for efficiently allocatingresources based on BSR index. Assume that the buffer index table may bepredefined as following table 2.

TABLE 2 BSR index Buffer Size (bytes) . . . . . . 72 ≤926 73 ≤987 74≤1051 75 ≤1119 . . . . . . 124 ≤24371 125 ≤25953 126 ≤27638 . . . . . .178 ≤727427 179 ≤774645 180 ≤824928 181 ≤878475

As shown, in FIG. 3A, the UE 105 may transmit a buffer size of “950”with a BSR index value of “73”. Since, the buffer size corresponding toBSR index value “73” i.e., “987” is equal to the predefined thresholdvalue, the grant allocation system 103 allocates maximum buffer sizei.e., “987” bytes. Thus, the UE 105 transmits 950 bytes of data alongwith 30 padding bytes.

FIG. 3B-3C show exemplary scenarios when the buffer size correspondingto the received BSR index value is greater than the predefined thresholdvalue. In FIG. 3B, as shown, the UE 105 transmits a UL data transmissionrequest to the grant allocation system 103 with a BSR index of “180” forbuffer size “800000”. Based on the request, the grant allocation system103 may determine the allocation by comparing the received buffer sizewith the predefined threshold value. In this case, the maximum buffervalue corresponding to the (BSR index-n), where n=1, index value “179”is “774645”, which is the threshold value. The buffer value isdetermined to be greater than the threshold value. In such case, thegrant allocation system 103 allocates the resources to the UE 105corresponding to a maximum buffer size of (BSR−n with n=1), which isbuffer size corresponding to “179”, i.e., “774645”. Accordingly, the UE105 transmit “774645” bytes of UL data to the grant allocation system103. On receiving the UL data, the grant allocation system 103 may checkfor padding bits or for a condition of maximum allocation. In this case,the grant allocation system 103 determines that no padding bits areadded in the UL data and the allocation has not reached the maximumnumber of allocation. In such case, the grant allocation system 103performs subsequent allocation by determining the allocated grant basedon the ratio of difference between previously requested BSR index (whichis 180) and allocated BSR (BSR-1) (which is 179) and the predefinedscaling value. The maximum buffer size for previously requested BSRindex value 180 is “824928” and for the allocated BSR 179 is “774645”.Consider, for example, the scaling factor is “2”. The ratio ofdifference between previously requested BSR index (which is 180) andallocated BSR (BSR-1) (which is 179) is depicted below by equation 2.Ratio of difference=(The maximum buffer size for previously requestedBSR index−the maximum buffer size for allocated BSR index)/scalingfactor  (2)

In the aforementioned example, the maximum buffer size for previouslyrequested BSR index 180 is 824928, the maximum buffer size for allocatedBSR index 179 is 774645, and scaling factor is 2. Thus the ratio ofdifference in this case is 25141 obtained by calculating(824928−774645)/2

Based on the obtained value, which is “25141”, the grant allocationsystem 103 provides a subsequent allocation which is nearest to buffersize of “25141”, which is for BSR index “125”. Thus, the grantallocation system 103 provides allocation of BSR “125” which is “25953”.Hence, the UE 105 in such case may transmit the remaining UL data of“25355” along with the padding bits of “598” based on the differencebetween the allocated buffer size and the remaining buffer size. Hence,on receiving the UL data with the padding bits, the grant allocationsystem 103 stops the allocation as the UL transmission from the UE 105is completed.

Similarly, FIG. 3C shows an exemplary scenario when the UE 105 transmitthe signalling for BSR index of remaining data along with the UL data.In FIG. 3C, as shown, the UE 105 transmits a UL data transmissionrequest to the grant allocation system 103 with a BSR index of “180” forbuffer size “800000”. Based on the request, the grant allocation system103 may determine the allocation by comparing the received buffer sizewith the predefined threshold value. In this case, the maximum buffervalue corresponding to the (BSR index−n, with n=1) index value “179” is“774645”, which is the threshold value. The buffer value is determinedto be greater than the threshold value. In such case, the grantallocation system 103 allocates the resources to the UE 105corresponding to a maximum buffer size of (BSR index−n, n=1), which isbuffer size corresponding to “179”, i.e., “774645”. Accordingly, the UE105 transmit “774645” bytes of UL data to the grant allocation system103 along with a signalling for BSR index value of “125” for remainingdata, i.e., “25355”. On receiving the UL data along with the BSR indexvalue of “125” for remaining data, the grant allocation system 103 mayfurther determine the allocation by comparing the received buffer size“25355” with the predefined threshold value. In this case, the maximumbuffer value corresponding to the (BSR index−n, n=1) index value “124”is “24371”, which is the threshold value. The buffer value is determinedto be greater than the threshold value. In such case, the grantallocation system 103 allocates the resources to the UE 105corresponding to a maximum buffer size of (BSR-1), which is buffer sizecorresponding to “124”, i.e., “24371”. Accordingly, the UE 105 transmit“24371” bytes of UL data to the grant allocation system 103 along with asignalling for BSR index value of “73” for remaining data, i.e., “984”.On receiving the UL data along with the BSR index value of “73” forremaining data, the grant allocation system 103 may determine theallocation by comparing the received buffer size “984” with thepredefined threshold value. In this case, the maximum buffer valuecorresponding to the BSR index value (BSR−n, with n=1) i.e., “72” is“926”, which is the threshold value. The buffer value is determined tobe greater than the threshold value. In such case, the grant allocationsystem 103 allocates the resources to the UE 105 corresponding to arequested buffer size of BSR which is buffer size corresponding to “73”.Hence, the UE 105 in such case may transmit the remaining UL data of“984” along with the padding bits of “3” based on the difference betweenthe allocated buffer size and the remaining buffer size. Thus, onreceiving the UL data with the padding bits, the grant allocation system103 stops the allocation as the UL transmission from the UE 105 iscompleted.

FIG. 2B shows a detailed block diagram of a User Equipment (UE) inaccordance with some embodiments of the present disclosure.

The UE 105 may include data 223 and one or more modules 231 which aredescribed herein in detail. In an embodiment, data 223 may be storedwithin the memory 119. The data 223 may include, for example, bufferindex data 225, buffer index table 227, and other data 229.

The buffer index data 225 may include the buffer size related to theuplink data transmission and the buffer index value corresponding to thebuffer size which is to be transmitted.

The buffer index table 227 includes the predefined buffer index tablewhich may be used for determining the index value. The buffer indextable 227 may be same as the existing index table.

The other data 229 may store data, including temporary data andtemporary files, generated by modules 231 for performing the variousfunctions of the UE 105.

In an embodiment, the data 223 in the memory 119 are processed by theone or more modules 231 present within the memory 119 of the UE 105. Inan embodiment, the one or more modules 231 may be implemented asdedicated units. As used herein, the term module refers to anapplication specific integrated circuit (ASIC), an electronic circuit, afield-programmable gate arrays (FPGA), Programmable System-on-Chip(PSoC), a combinational logic circuit, and/or other suitable componentsthat provide the described functionality. In some implementations, theone or more modules 231 may be communicatively coupled to the processor121 for performing one or more functions of the UE 105. The said modules231 when configured with the functionality defined in the presentdisclosure will result in a novel hardware.

In one implementation, the one or more modules 231 may include, but arenot limited to a communication module 233, an uplink transmission module235, and a buffer index determination module 237. The one or moremodules 231 may also include other modules 239 to perform variousmiscellaneous functionalities of the UE 105. In an embodiment, the othermodules 221 may include a threshold determining module which maydetermine maximum buffer value corresponding to received BSR indexvalue.

The communication module 233 may obtain the resource allocation from thegrant allocation system 103 of the BS 101.

The uplink transmission module 235 may transmit the determined BSR indexvalue along with the with the buffer size corresponding to UL data tothe BS 101. Further, the uplink transmission module 235 may alsotransmit the UL data along with the BSR index value for remaining ULdata iteratively until the transmission the UL data is completed.

The buffer index determination module 237 may determine the BSR indexvalue for the buffer size using the predefined buffer index table. Forinstance, consider the buffer size is “950” bytes, which falls in arange of “926 and 987” corresponding to BSR index value 72 and 73respectively in the predefined buffer index table. In such case, thebuffer index determination module 237 may determine the BSR index valuefor “950” bytes as “73”.

FIG. 4A illustrates a flowchart showing a method for efficientallocating grants for resource allocation based on BSR index by basestation, in accordance with some embodiments of present disclosure.

As illustrated in FIG. 4A, the method 400 includes one or more blocksfor efficient allocating grants for resource allocation based on BSRindex. The method 400 may be described in the general context ofcomputer executable instructions. Generally, computer executableinstructions can include routines, programs, objects, components, datastructures, procedures, modules, and functions, which perform particularfunctions or implement particular abstract data types.

The order in which the method 400 is described is not intended to beconstrued as a limitation, and any number of the described method blockscan be combined in any order to implement the method. Additionally,individual blocks may be deleted from the methods without departing fromthe scope of the subject matter described herein. Furthermore, themethod can be implemented in any suitable hardware, software, firmware,or combination thereof.

In operation 401, the BSR index value is received by the communicationmodule 213 from the UE 105 along with the buffer size corresponding tothe UL data transmission request. The BSR index value being determinedby the UE 105 based on the buffer size of the UL data.

In operation, the buffer size determination module 215 determines thebuffer size corresponding to the received BSR index value to be greaterthan the predefined threshold value. The determination is performed bycomparing the buffer size corresponding to the received BSR index valuewith the predefined threshold value. In an embodiment, the predefinedthreshold value refers to the maximum buffer value corresponding to thereceived BSR index value.

In operation, the resources to the UE 105 are allocated by the resourceallocation module 217 corresponding to a maximum buffer size of index(BSR index-n, where n is an integer number greater than or equal to “0”.

In operation 407, the resources are allocated by the efficient resourceallocation module 219 to the UE subsequently using the predefinedallocation mechanism until one of, detection of padding bits in thereceived UL data and on detecting the maximum allocation of predefinednumber of allocation. The predefined allocation mechanism includesdetermining upon receiving the UL data from the UE 105, the buffer sizefor allocation based on the ratio of difference between previouslyrequested BSR index and the allocated BSR (BSR index-n) and thepredefined scaling value. In an embodiment, the predefined scaling valueis the integer value.

FIG. 5A-5B illustrate an exemplary flowchart for allocating grants forresource allocation based on BSR index in accordance with someembodiments of the present disclosure.

FIG. 5A shows an exemplary flowchart for allocating grants for resourceallocation when no signalling from the UE 105 is received along with theUL data. The steps followed by the grant allocation system 103 aredefined below.

In operation 501, the maximum number of allocation is defined as “M” andthe iteration is set to “0”.

In operation 502, the grant allocation system 103 receives the BSR indexvalue, say “X” along with the buffer size, say “Z”, from the UE 105.

In operation 503, the grant allocation system 103 updates the receivedBSR index value with “X” and the buffer size with “Z”.

In operation 504, the grant allocation system 103 may check if thebuffer size “Z” is within an interval with a width less than thepredefined threshold value. In case the buffer size “Z” is within theinterval and less than the predefined threshold value, the method movesto operation 505. Alternatively, if the buffer size “Z” is greater thanthe predefined threshold value, the method moves to operation 506.

In operation block 505, the grant allocation system 103 allocates themaximum number of bytes correcting to the requested BSR, i.e., X.

In operation 506, the grant allocation system 103 may check if thenumber of iteration for allocation is equal to zero. In case the numberof iteration is zero, the method moves to operation 507. Otherwise, themethod moves to operation 509.

In operation 507, the grant allocation system 103 allocates maximumnumber of bytes corresponding to index of (BSR index-n, where n is aninteger number greater than or equal to “0”.

In operation 508, the grant allocation system 103 updates the buffersize “Z” with difference of “Z” and the allocated bytes and incrementsthe number of iteration to one. Further, the method moves to operation504.

In operation 509, the grant allocation system 103 allocates subsequentgrants based on the ratio of difference between the maximum number ofbytes of “X” and “X-n” and scaling factor E.

In operation 510, the grant allocation system 103 updates the number ofiteration by one.

In operation 511, the grant allocation system 103 updates the buffersize “Z” with difference of “Z” and the allocated bytes.

In operation 512, the grant allocation system 103 checks if the buffersize “Z” is greater than zero. Particularly, the grant allocation system103 checks for the dummy bits. In case “Z” is greater than zero, themethod moves to block 513. Otherwise, the method ends.

In operation 513, the grant allocation system 103 checks if the numberof iterations is reached maximum number of iterations. In case thenumber of iterations is maximum number of iterations, the method ends.Otherwise, the method moves to operation 514.

In operation 514, the grant allocation system 103 checks if the buffersize “Z” is within the interval with the width less than the predefinedthreshold value. If yes, the method moves to operation 509. Otherwise,the method end.

FIG. 5B shows an another exemplary flowchart for allocating grants forresource allocation when signalling from the UE 105 is received alongwith the UL data. The steps followed by the grant allocation system 103are defined below.

In operation 520, the grant allocation system 103 receives the BSR indexvalue, say “X” along with the buffer size, say “Z”, from the UE 105.

In operation 521, the grant allocation system 103 updates the receivedBSR index value with “X” and the buffer size with “Z”.

In operation 522, the grant allocation system 103 may check if thebuffer size “Z” is within an interval with a width less than thepredefined threshold value. In case the buffer size “Z” is within theinterval and less than the predefined threshold value, the method movesto operation 525. Alternatively, if the buffer size “Z” is greater thanthe predefined threshold value, the method moves to operation 523.

In operation block 523, the grant allocation system 103 allocatesmaximum number of bytes corresponding to index of (BSR index-n, where nis an integer number greater than or equal to “0”.

In operation 524, the grant allocation system 103 updates the buffersize “Z” with difference of “Z” and the allocated bytes and incrementsthe number of iteration to one. Further, the method moves to operation521.

In operation 525, if the buffer size “Z” is less than the predefinedthreshold value, the grant allocation system 103 allocates the maximumnumber of bytes corresponding to “X” and the method end.

FIG. 4B illustrates a flowchart showing a method for efficientallocating grants for resource allocation based on BSR index by basestation in accordance with some embodiments of present disclosure.

In operation 409, the BSR index value is received by the communicationmodule 213 from the UE 105 along with the buffer size corresponding tothe UL data transmission request. The BSR index value being determinedby the UE 105 based on the buffer size of the UL data.

In operation 411, the buffer size determination module 215 compares thebuffer size corresponding to the received BSR index value with thepredefined threshold value.

In operation 413, the resources to the UE 105 are allocated by theresource allocation module 217 corresponding to a maximum buffer size ofindex (BSR index n, where n is a whole number and greater than or equalto “0”) on determining the buffer size to be greater than the predefinedthreshold value.

In operation 415, the UL data is received by the communication module213 based on the allocated resources along with a BSR index value forthe remaining data in buffer.

In operation 417, repeatedly, performing steps of operations 411, 413and 415 until detecting one of, the buffer size corresponding to therequested BSR index value to be less than the predefined threshold valueand on detecting maximum allocation of predefined number of allocations.

Alternatively, in another implementation, the BS 101, particularly, thegrant allocation system 103 may allocate grants for resource allocationusing neural network technique. Particularly, the BS 101 on receiving aBuffer Status Report (BSR) index value from the UE 105 may estimate anoptimal resource grant for the requested BSR index based on at least oneof UE parameters and network parameters using a pretrained neuralnetwork model. The neural network may be trained using one or moreparameters such as, time, BS identification number, frequency ofoperation, bandwidth paths, day details, place of location, density ofthe traffic, distribution of the traffic, climate conditions, occasions,calendar based events, vacation details/distribution, UE information, UEtype, UE category, Beam index, TX mode, NOMA mode or full duplex mode orNOMA-Full duplex mode, antenna parameters and monthly package, data typeinformation, holiday related parameters, measurements, offers on releasedate, one or more events, QoS and QCI (QoS class identifier) anddifferent communication capability information. The neural network modelis trained either using instantaneous or offline data associated withplurality of UE's and network.

In an embodiment, the trained neural network model may be implementedusing a deep learning neural network or a machine learning model orartificial intelligence model. Such neural network may be trained usingbelief propagation algorithm to estimate optimal grant of resources. Inan embodiment, the trained neural network may be a software module orhardware module. Such trained neural network may run in CU or DU or RICor any intelligence module and may be situated in any layer based onimplementation and architecture of network. In an embodiment, the neuralnetwork may be a Convolution Neural Network (CNN) or Recurrent NeuralNetwork (RNN), or Deep Neural Network (DNN) or sparse CNN or sparse DNNor Sparse RNN or hybrid-based architectures.

FIG. 6 illustrates a flowchart showing a method for allocating grantsfor resource allocation based on BSR index by user equipment, inaccordance with some embodiments of present disclosure.

In operation 601, the Buffer Status Report (BSR) index value isdetermined by the buffer index determination module 237 for Uplink (UL)data to be transmitted using the predefined buffer index table.

In operation 603, the determined BSR index value is transmitted by theuplink transmission module 235 along with buffer size corresponding tothe Uplink (UL) data.

In operation 605, the allocated resource is received by thecommunication module 233 corresponding to maximum buffer size of(BSR-1).

In operation 607, the UL data is transmitted by the uplink transmissionmodule 235 along with the BSR index value for remaining UL dataiteratively until the transmission the UL data is completed. FIG. 7illustrates exemplary graphs for simulation output for BSR index“121-200” in accordance with some embodiments of present disclosure. ABSR index may be predetermined according to the network communicationsystem such as 3rd Generation Partnership Project (3GPP) Long TermEvolution (LTE) systems, and 5th generation communication system (5GNR). Referring to FIG. 7 , according to the present disclosure, theamount of dummy bytes is reduced as the BSR index increase.

FIG. 8 illustrates a block diagram of an exemplary user equipment 800for implementing embodiments consistent with the present disclosure. Theuser equipment 800 may include a central processing unit (“CPU” or“processor”) 802. The processor 802 may include at least one dataprocessor for efficiently allocating grants for resource allocationbased on BSR index. The processor 802 may include specialized processingunits such as, integrated system (bus) controllers, memory managementcontrol units, floating point units, graphics processing units, digitalsignal processing units, etc.

The processor 802 may be disposed in communication with one or moreinput/output (I/O) devices (not shown) via I/O interface 801. The I/Ointerface 801 may employ communication protocols/methods such as,without limitation, audio, analog, digital, monoaural, RCA, stereo,IEEE-1394, serial bus, universal serial bus (USB), infrared, PS/2, BNC,coaxial, component, composite, digital visual interface (DVI),high-definition multimedia interface (HDMI), RF antennas, S-Video, VGA,IEEE 802.n/b/g/n/x, Bluetooth, cellular (e.g., code-division multipleaccess (CDMA), high-speed packet access (HSPA+), global system formobile communications (GSM), long-term evolution (LTE), WiMax, or thelike), etc.

Using the I/O interface 801, the user equipment 800 may communicate withone or more I/O devices. For example, the input device may be anantenna, keyboard, mouse, joystick, (infrared) remote control, camera,card reader, fax machine, dongle, biometric reader, microphone, touchscreen, touchpad, trackball, stylus, scanner, storage device,transceiver, video device/source, etc. The output device may be aprinter, fax machine, video display (e.g., cathode ray tube (CRT),liquid crystal display (LCD), light-emitting diode (LED), plasma, Plasmadisplay panel (PDP), Organic light-emitting diode display (OLED) or thelike), audio speaker, etc.

The processor 802 may be disposed in communication with thecommunication network 809 via a network interface 803. The networkinterface 803 may communicate with the communication network 809. Thenetwork interface 803 may employ connection protocols including, withoutlimitation, direct connect, Ethernet (e.g., twisted pair 10/100/1000Base T), transmission control protocol/internet protocol (TCP/IP), tokenring, IEEE 802.11a/b/g/n/x, etc. The communication network 809 mayinclude, without limitation, a direct interconnection, local areanetwork (LAN), wide area network (WAN), wireless network (e.g., usingWireless Application Protocol), the Internet, etc. Using the networkinterface 803 and the communication network 809, the user equipment 800may communicate with grant allocation system 103. The network interface803 may employ connection protocols include, but not limited to, directconnect, Ethernet (e.g., twisted pair 10/100/1000 Base T), transmissioncontrol protocol/internet protocol (TCP/IP), token ring, IEEE802.11a/b/g/n/x, etc.

The communication network 809 includes, but is not limited to, a directinterconnection, an e-commerce network, a peer to peer (P2P) network,local area network (LAN), wide area network (WAN), wireless network(e.g., using Wireless Application Protocol), the Internet, Wi-Fi, andsuch. The first network and the second network may either be a dedicatednetwork or a shared network, which represents an association of thedifferent types of networks that use a variety of protocols, forexample, Hypertext Transfer Protocol (HTTP), Transmission ControlProtocol/Internet Protocol (TCP/IP), Wireless Application Protocol(WAP), etc., to communicate with each other. Further, the first networkand the second network may include a variety of network devices,including routers, bridges, servers, computing devices, storage devices,etc.

In some embodiments, the processor 802 may be disposed in communicationwith a memory 705 (e.g., RAM, ROM, etc. not shown in FIG. 8 ) via astorage interface 804. The storage interface 704 may connect to memory705 including, without limitation, memory drives, removable disc drives,etc., employing connection protocols such as, serial advanced technologyattachment (SATA), Integrated Drive Electronics (IDE), IEEE-1394,Universal Serial Bus (USB), fiber channel, Small Computer SystemsInterface (SCSI), etc. The memory drives may further include a drum,magnetic disc drive, magneto-optical drive, optical drive, RedundantArray of Independent Discs (RAID), solid-state memory devices,solid-state drives, etc.

The memory 805 may store a collection of program or database components,including, without limitation, user interface 806, an operating system807 etc. In some embodiments, e user equipment 800 may storeuser/application data, such as, the data, variables, records, etc., asdescribed in this disclosure. Such databases may be implemented asfault-tolerant, relational, scalable, secure databases such as Oracle orSybase.

The operating system 807 may facilitate resource management andoperation of the user equipment 800. Examples of operating systemsinclude, without limitation, APPLE MACINTOSHR OS X, UNIXR, UNIX-likesystem distributions (E.G., BERKELEY SOFTWARE DISTRIBUTION™ (BSD),FREEBSD™, NETBSD™, OPENBSD™, etc.), LINUX DISTRIBUTIONS™ (E.G., REDHAT™, UBUNTU™, KUBUNTU™, etc.), IBM™ OS/2, MICROSOFT™ WINDOWS™ (XP™,VISTA™/7/8, 10 etc.), APPLER IOS™, GOOGLER ANDROID™, BLACKBERRYR OS, orthe like.

In some embodiments, the user equipment 800 may implement a web browser808 stored program component. The web browser 808 may be a hypertextviewing application, for example MICROSOFT® INTERNET EXPLORER™, GOOGLE®CHROME™, MOZILLA® FIREFOX™, APPLE® SAFARI™, etc. Secure web browsing maybe provided using Secure Hypertext Transport Protocol (HTTPS), SecureSockets Layer (SSL), Transport Layer Security (TLS), etc. Web browser608 may utilize facilities such as AJAX™, DHTML™, ADOBE® FLASH™,JAVASCRIPT™, JAVA™, Application Programming Interfaces (APIs), etc. Insome embodiments, the user equipment 800 may implement a mail serverstored program component. The mail server may be an Internet mail serversuch as Microsoft Exchange, or the like. The mail server may utilizefacilities such as ASP™, ACTIVEX™, ANSI™ C++/C #, MICROSOFT®, NET™, CGISCRIPTS™, JAVA™, JAVASCRIPT™, PERL™, PHP™, PYTHON™, WEBOBJECTS™, etc.The mail server may utilize communication protocols such as InternetMessage Access Protocol (IMAP), Messaging Application ProgrammingInterface (MAPI), MICROSOFT® exchange, Post Office Protocol (POP),Simple Mail Transfer Protocol (SMTP), or the like. In some embodiments,the user equipment 800 may implement a mail client stored programcomponent. The mail client may be a mail viewing application, such asAPPLE® MAIL™, MICROSOFT® ENTOURAGE™, MICROSOFT® OUTLOOK™, MOZILLA®THUNDERBIRD™, etc.

Furthermore, one or more computer-readable storage media may be utilizedin implementing embodiments consistent with the present disclosure. Acomputer-readable storage medium refers to any type of physical memoryon which information or data readable by a processor may be stored.Thus, a computer-readable storage medium may store instructions forexecution by one or more processors, including instructions for causingthe processor(s) to perform steps or stages consistent with theembodiments described herein. The term “computer-readable medium” shouldbe understood to include tangible items and exclude carrier waves andtransient signals, i.e., be non-transitory. Examples include RandomAccess Memory (RAM), Read-Only Memory (ROM), volatile memory,non-volatile memory, hard drives, CD ROMs, DVDs, flash drives, disks,and any other known physical storage media.

The present disclosure helps in efficiently allocating and schedulingresource grant based on BSR index value to minimize byte padding. Inaddition, the present disclosure allows network to save on uplinkresource and serve more users by differing BSR grant resources to UE inmultiple iterations.

An embodiment of the present disclosure facilitates UE to require lesserpower for transmission the same amount of the data when compared toexisting transmission techniques.

An embodiment of the present disclosure helps in optimizing theallocated radio resources.

An embodiment of the present disclosure increases overall systemthroughput since the spectral efficiency is improved.

The described operations may be implemented as a method, system orarticle of manufacture using standard programming and/or engineeringtechniques to produce software, firmware, hardware, or any combinationthereof. The described operations may be implemented as code maintainedin a “non-transitory computer readable medium”, where a processor mayread and execute the code from the computer readable medium. Theprocessor is at least one of a microprocessor and a processor capable ofprocessing and executing the queries. A non-transitory computer readablemedium may include media such as magnetic storage medium (e.g., harddisk drives, floppy disks, tape, etc.), optical storage (CD-ROMs, DVDs,optical disks, etc.), volatile and non-volatile memory devices (e.g.,EEPROMs, ROMs, PROMs, RAMs, DRAMs, SRAMs, Flash Memory, firmware,programmable logic, etc.), etc. Further, non-transitorycomputer-readable media include all computer-readable media except for atransitory. The code implementing the described operations may furtherbe implemented in hardware logic (e.g., an integrated circuit chip,Programmable Gate Array (PGA), Application Specific Integrated Circuit(ASIC), etc.).

Still further, the code implementing the described operations may beimplemented in “transmission signals”, where transmission signals maypropagate through space or through a transmission media, such as, anoptical fiber, copper wire, etc. The transmission signals in which thecode or logic is encoded may further include a wireless signal,satellite transmission, radio waves, infrared signals, Bluetooth, etc.The transmission signals in which the code or logic is encoded iscapable of being transmitted by a transmitting station and received by areceiving station, where the code or logic encoded in the transmissionsignal may be decoded and stored in hardware or a non-transitorycomputer readable medium at the receiving and transmitting stations ordevices. An “article of manufacture” includes non-transitory computerreadable medium, hardware logic, and/or transmission signals in whichcode may be implemented. A device in which the code implementing thedescribed embodiments of operations is encoded may include a computerreadable medium or hardware logic. Of course, those skilled in the artwill recognize that many modifications may be made to this configurationwithout departing from the scope of the disclosure, and that the articleof manufacture may include suitable information bearing medium known inthe art.

The terms “an embodiment”, “embodiment”, “embodiments”, “theembodiment”, “the embodiments”, “one or more embodiments”, “someembodiments”, and “one embodiment” mean “one or more (but not all)embodiments of the disclosure” unless expressly specified otherwise.

The terms “including”, “comprising”, “having” and variations thereofmean “including but not limited to”, unless expressly specifiedotherwise.

The enumerated listing of items does not imply that any or all of theitems are mutually exclusive, unless expressly specified otherwise.

The terms “a”, “an” and “the” mean “one or more”, unless expresslyspecified otherwise.

A description of an embodiment with several components in communicationwith each other does not imply that all such components are required. Onthe contrary, a variety of optional components are described toillustrate the wide variety of possible embodiments of the disclosure.

When a single device or article is described herein, it will be readilyapparent that more than one device/article (whether or not theycooperate) may be used in place of a single device/article. Similarly,where more than one device or article is described herein (whether ornot they cooperate), it will be readily apparent that a singledevice/article may be used in place of the more than one device orarticle or a different number of devices/articles may be used instead ofthe shown number of devices or programs. The functionality and/or thefeatures of a device may be alternatively embodied by one or more otherdevices which are not explicitly described as having suchfunctionality/features. Thus, other embodiments of the disclosure neednot include the device itself.

The illustrated operations of FIGS. 5A, 5B and 6 show certain eventsoccurring in a certain order. In alternative embodiments, certainoperations may be performed in a different order, modified, or removed.Moreover, steps may be added to the above-described logic and stillconform to the described embodiments. Further, operations describedherein may occur sequentially or certain operations may be processed inparallel. Yet further, operations may be performed by a singleprocessing unit or by distributed processing units.

Finally, the language used in the specification has been principallyselected for readability and instructional purposes, and it may not havebeen selected to delineate or circumscribe the inventive subject matter.It is therefore intended that the scope of the disclosure be limited notby this detailed description, but rather by any claims that issue on anapplication based here on. Accordingly, the disclosure of theembodiments of the disclosure is intended to be illustrative, but notlimiting, of the scope of the disclosure, which is set forth in thefollowing claims.

While various aspects and embodiments have been disclosed herein, otheraspects and embodiments will be apparent to those skilled in the art.The various aspects and embodiments disclosed herein are for purposes ofillustration and are not intended to be limiting, with the true scopeand spirit being indicated by the following claims.

Although the present disclosure has been described with variousembodiments, various changes and modifications may be suggested to oneskilled in the art. It is intended that the present disclosure encompasssuch changes and modifications as fall within the scope of the appendedclaims.

What is claimed is:
 1. A method for allocating resource in wirelesscommunication network, the method comprising: receiving a buffer statusreport (BSR) index value from a user equipment (UE) along with buffersize corresponding to an uplink (UL) data transmission request;determining the buffer size corresponding to the received BSR indexvalue to be greater than a predefined threshold value; allocatingresources to the UE corresponding to a maximum buffer size of (BSRindex-n), where n is an integer greater than or equal to 0; and uponreceiving UL data from the UE based on the allocated resources,re-allocating the resources to the UE subsequently until padding bits inthe received UL data or maximum allocation of predefined number ofallocation is detected, wherein, upon receiving the UL data from the UE,the buffer size for re-allocation is determined based on a ratio ofdifference between previously requested BSR index and allocated BSRindex (BSR-n) and a predefined scaling value.
 2. The method of claim 1,wherein the BSR index value is determined by the UE based on buffer sizeof the UL data.
 3. The method of claim 1, wherein determining comprisescomparing the buffer size corresponding to the received BSR index valuewith the predefined threshold value.
 4. The method of claim 1, whereinallocating the resources to the UE comprises allocating the resourcescorresponding to maximum buffer size of received BSR index value ondetermining the buffer size to be less than the predefined thresholdvalue.
 5. The method of claim 1, wherein value of “n” is determinedbased on load on a base station (BS) and the UE and network parameters.6. The method of claim 1, wherein the predefined threshold value refersto maximum buffer value corresponding to received (BSR-n) index value.7. The method of claim 1, wherein the predefined scaling value is aninteger value.
 8. The method of claim 1, the method further comprisingestimating an optimal resource grant for the UE for the received BSRindex value based on at least one of UE parameters and networkparameters using a pretrained machine learning model.
 9. The method ofclaim 8, wherein the pretrained machine learning model is trained usingtime, BS identification number, frequency of operation, bandwidth paths,day details, place of location, density of traffic, distribution of thetraffic, climate conditions, occasions, calendar based events, vacationdetails/distribution, UE information, UE type, UE category, Beam index,non-orthogonal multiple access/orthogonal multiple access (NOMA/OMA)mode, full duplex mode or half duplex mode or time division duplex (TDD)or frequency division duplex (FDD) mode or dynamic TDD mode and monthlypackage, data type information, holiday related parameters,measurements, offers on release date, one or more events, quality ofservice (QoS) and QoS class identifier (QCI) and different communicationcapability information.
 10. A system for allocating resource in wirelesscommunication network, the system comprising: a processor; and a memorycoupled to the processor, wherein the memory stores processorinstructions, which, on execution, causes the processor to: receive abuffer status report (BSR) index value from a user equipment (UE) alongwith buffer size corresponding to an uplink (UL) data transmissionrequest; determine the buffer size corresponding to the received BSRindex value to be greater than a predefined threshold value; allocateresources to the UE corresponding to maximum buffer size of (BSRindex-n), where n is an integer greater than or equal to 0; and uponreceiving UL data from the UE based on the allocated resources,re-allocate the resources to the UE subsequently until padding bits inthe received UL data or maximum allocation of predefined number ofallocation is detected, wherein, the processor is further configured to,upon receiving the UL data from the UE, determining the buffer size forre-allocation based on a ratio of difference between previouslyrequested BSR index and allocated BSR index (BSR-n) and a predefinedscaling value.
 11. The system of claim 10, wherein the BSR index valueis determined by the UE based on buffer size of the UL data.
 12. Thesystem of claim 10, wherein the processor determines the buffer size bycomparing the buffer size corresponding to the received BSR index valuewith the predefined threshold value.
 13. The system of claim 10, whereinthe processor allocates the resources to the UE by allocating theresources corresponding to maximum buffer size of received BSR indexvalue on determining the buffer size to be less than the predefinedthreshold value.
 14. The system of claim 10, wherein the predefinedthreshold value refers to maximum buffer value corresponding to receivedBSR index value.
 15. The system of claim 7, wherein the predefinedscaling value is an integer value.
 16. The system of claim 10, whereinthe processor estimates an optimal resource grant for the UE for thereceived BSR index value based on at least one of UE parameters andnetwork parameters using a pretrained machine learning model.